A derived algorithm for evaluating ɛ-expressions over abstract sets
نویسندگان
چکیده
منابع مشابه
Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract
We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nom...
متن کاملTowards a semantics for mass expressions derived from gradable expressions
What semantics should we attribute to mass expressions like wisdom and love, which are derived from gradable expressions (wise, to love)? We first examine how these expressions are used, then how they are interpreted in their various uses. We show in particular that, just like with ordinary concrete mass nouns (wine, furniture), sentences where they appear are liable to distributive, collective...
متن کاملBLOSOM: A Framework for Mining Arbitrary Boolean Expressions over Attribute Sets
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. For each category, we propose a closure operator that naturally leads to the concept of a closed boolean expression. Th...
متن کاملAn algorithm for convexity of semilinear sets over ordered fields
In this paper we study semilinear sets over arbitrary ordered fields. In particular we show that open (resp. closed) semilinear sets are convex if and only if they are basic, that is, a finite intersection of open (resp. closed) halfspaces. As a corollary we get that any bounded convex closed semilinear set is the convex hull of a finite family of points and we obtain a separation result for co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1993
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(06)80009-x